An incremental algorithm for DLO quantifier elimination via constraint propagation
نویسندگان
چکیده
منابع مشابه
Quantifier elimination via adjunction
Sufficient conditions are provided for quantifier elimination to hold in a first-order theory. The conditions have two main purposes: (1) to ensure that satisfaction of existential formulas is reflected by an embedding; and (2) to guarantee the existence of a “minimal" model of the theory extending a model of the universal formulas entailed by the theory. The first goal is obtained by requiring...
متن کاملQuantifier Elimination-Based Constraint Logic Programming
We present an extension of constraint logic programming, where the admissible constraints are arbitrary first-order formulas over some domain. Constraint solving is realized by effective quantifier elimination. The current realization in our CLP(RL) system provides as possible domains R, C, and Qp for primes p. In R and C we admit arbitrary degrees in our constraints. In Qp we restrict to linea...
متن کاملAn Improved Algorithm for Quantifier Elimination Over Real Closed Fields
In this paper we give a new algorithm for quanti-er elimination in the rst order theory of real closed elds that improves the complexity of the best known algorithm for this problem till now. Unlike previously known algorithms 3, 25, 20] the combinatorial part of the complexity of this new algorithm is independent of the number of free variables. Moreover, under the assumption that each polynom...
متن کاملAn Improved Constraint-Propagation Algorithm for Diagnosis
Diagnosing a system requires the identification of a set of components whose abnormal behavior could explain the faulty sys tem behavior. Previously, model-based diagnosis schemes have pro ceeded through a cycle of assumptions -* predictions observations assumptions-adjustment, where the basic assumptions entail the proper functioning of those components whose failure is not esta blished. He...
متن کاملIncremental Constraint Propagation for Interleaved Distributed Backtracking
This paper describes a way to integrate established propagation techniques known from monolithic algorithms in the asynchronous distributed tree-based algorithm IDIBT without extending its protocol. It furthermore provides some preliminary experimental results of the integrated algorithms. These results show that propagation can often, especially in very hard problems, reduce the number of requ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2004
ISSN: 0004-3702
DOI: 10.1016/j.artint.2004.05.011